A class of low-rate nonlinear binary codes

A Class of Low-Rate Nonlinear Binary Codes

T h i s paper in t roduces a new class of nonl inear b inary codes. For each l = 2, 3,... we presen t a code wi th 2 4z codewords of l eng th N = 4 z and dis tance d ~ (4 z U)]2. Each code is a supercode of the l s t -o rde r R e e d M u l l e r (RM) code and a subcode of the 2nd-order R M code. T h e s e codes are the "dua l s " of the ex tended nonl inear Preparata codes in the sense tha t th...

A Low Complexity Stack Decoder for a Class of Binary Rate (n-1)/n Convolutional Codes

Low Bit Rate Coding with Binary Golay Codes

Even if the computational power is constantly increasing, as well as the storage resources, the type and quantity of data stored and exchanged over the communication channels is expanding. Multimedia communication becomes an everyday aspect of our lives, and with it our expectations relative to the quality of both the communication and content are raising. From the content coding point of view,...

A class of binary rate one-half convolutional codes that allows an improved stack decoder

T HIS INTRODUCTORY section applies to general binary rate k/n convolutional codes. In Section II we specialize to rate one-half to describe a class of codes that allows an interesting mod ification of the stack decoding algorithm [l]-[2]. Section III presents our simulation results. Let G be a conventional convolutional encoder [3] whose rows are the first k rows of a polynomial n X n matrix B ...

Minimum Distance of Binary Nonlinear Codes∗

A binary nonlinear code can be represented as the union of cosets of a binary linear subcode. Using this representation, new algorithms methods to compute the minimum Hamming weight and distance are presented. The performance of these algorithms is also studied.